A nearly optimal preconditioning based on recursive red-black orderings

Considering matrices obtained by the application of a five-point stencil on a 2D rectangular grid, we analyse a preconditioning method introduced by Axelsson and Eijkhout, and by Brand and Heinemann. In this method, one performs a (modified) incomplete factorization with respect to a so-called ‘repeated’ or ‘recursive’ red– black ordering of the unknowns while fill-in is accepted provided that the red unknowns in a same level remain uncoupled. Considering discrete second order elliptic PDEs with isotropic coefficients, we show that the condition